Formalizing and Executing Message Sequence Charts via Timed Rewriting
نویسندگان
چکیده
منابع مشابه
Automata and Logics for Timed Message Sequence Charts
We provide a framework for distributed systems that impose timing constraints on their executions. We propose a timed model of communicating finite-state machines, which communicate by exchanging messages through channels and use event clocks to generate collections of timed message sequence charts (T-MSCs). As a specification language, we propose a monadic secondorder logic equipped with timin...
متن کاملCausal Message Sequence Charts
Scenario languages based on Message Sequence Charts (MSCs) and related notations have been widely studied in the last decade [14, 13, 2, 9, 5, 12, 8]. The high expressive power of scenarios renders many basic problems concerning these languages undecidable. The most expressive class for which several problems are known to be decidable is one which possesses a behavioral property called “existen...
متن کاملAnalyzing Message Sequence Charts
The ISO standard for MSC provides a useful tool for visualizing communication protocols MSCs present a model for concurrency that is di erent from the model of nite state systems used frequently in au tomated veri cation Thus the MSC model poses new and interesting problems related to automatic veri cation of communication protocols In this paper some of the recent results related to MSCs are s...
متن کاملMessage Sequence Charts
Message sequence charts (MSCs) constitute an attractive visual formalism that is widely used to capture system requirements during the early design stages in domains such as telecommunication software. A version of MSCs called sequence diagrams is one of the behavioral diagram types adopted in the UML. In this chapter we survey MSCs and their extensions. In particular, we discuss high level MSC...
متن کاملDynamic Message Sequence Charts
We introduce a formalism to specify classes of MSCs over an unbounded number of processes. The formalism can describe many interesting behaviours of dynamically changing networks of processes. Moreover, it strictly includes the formalism of Message Sequence Graphs studied in the literature to describe MSCs over a fixed finite set of processes. Our main result is that model-checking of MSCs desc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1999
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00131-8